SFSADE: an improved self-adaptive differential evolution algorithm with a shuffled frog-leaping strategy

نویسندگان

چکیده

Abstract The differential evolution (DE) algorithm is an efficient random search based on swarm intelligence for solving optimization problems. It has the advantages of easy implementation, fast convergence, strong ability and good robustness. However, performance DE very sensitive to design different operators setting control parameters. To solve these key problems, this paper proposes improved self-adaptive with a shuffled frog-leaping strategy (SFSADE). innovatively incorporates idea into DE, at same time, it cleverly introduces new classification mutation, also designs adaptive adjustment mechanism In addition, we have carried out large number simulation experiments 25 benchmark functions CEC 2005 two nonparametric statistical tests comprehensively evaluate SFSADE. Finally, results show that SFSADE effective in improving significantly improves overall diversity population process dynamic evolution. Compared other advanced variants, its global speed competitiveness.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Shuffled Frog Leaping Algorithm ⋆

In order to overcome the defects of Shuffled Frog Leaping Algorithm (SFLA) such as nonuniform initial population, slow searching speed in the late evolution and easily trapping into local extremum, a new Shuffled Frog Leaping Algorithm based on mutation operator and population diversity is proposed in this paper. The algorithm has overcome the disadvantage mentioned above. The algorithm efficie...

متن کامل

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

Shuffled frog-leaping algorithm (SFLA) has long been considered as new evolutionary algorithm of group evolution, and has a high computing performance and excellent ability for global search. Knapsack problem is a typical NP-complete problem. For the discrete search space, this paper presents the improved SFLA (ISFLA), and solves the knapsack problem by using the algorithm. Experimental results...

متن کامل

Adaptive Grouping Quantum Inspired Shuffled Frog Leaping Algorithm

--------------------------------------------------------ABSTRACT----------------------------------------------------------To enhance the optimization ability of classical shuffled frog leaping algorithm, a quantum inspired shuffled frog leaping algorithm with adaptive grouping is proposed. In this work, the frog swarms are adaptive grouped according to the average value of the objective functio...

متن کامل

Centroid Mutation Embedded Shuffled Frog-Leaping Algorithm

Stochastic search algorithms that take their inspiration from nature are gaining a great attention of many researchers to solve high dimension and non – linear complex optimization problems for which traditional methods fails. Shuffled frog – leaping algorithm (SFLA) is recent addition to the family of stochastic search algorithms that take its inspiration from the foraging process of frogs. SF...

متن کامل

Two-Phases Learning Shuffled Frog Leaping Algorithm

In order to overcome the drawbacks of standard shuffled frog leaping algorithm that converges slowly at the last stage and easily falls into local minima, this paper proposed two-phases learning shuffled frog leaping algorithm. The modified algorithm added the elite Gaussian learning strategy in the global information exchange phase, updated frog leaping rule and added the learning capability t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Artificial Intelligence Review

سال: 2021

ISSN: ['0269-2821', '1573-7462']

DOI: https://doi.org/10.1007/s10462-021-10099-9